Graph minor

Results: 171



#Item
41OFFICE OF RECORDS Declaration of Minor Form in or F  orm

OFFICE OF RECORDS Declaration of Minor Form in or F orm

Add to Reading List

Source URL: www.qatar.tamu.edu

Language: English - Date: 2015-10-15 04:34:38
42Exhaustive generation of k-critical H-free graphs Jan Goedgebeur∗ Oliver Schaudt†  Abstract

Exhaustive generation of k-critical H-free graphs Jan Goedgebeur∗ Oliver Schaudt† Abstract

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2015-06-10 03:36:10
43Quantum query complexity of minor-closed graph properties Andrew M. Childs and Robin Kothari Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo

Quantum query complexity of minor-closed graph properties Andrew M. Childs and Robin Kothari Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo

Add to Reading List

Source URL: qip2011.quantumlah.org

Language: English - Date: 2011-01-11 05:14:56
    446.889 — Lecture 25: Single-Source Shortest Paths with Negative Lengths in Minor-Free Graphs Christian Sommer  December 12, 2011 Setting directed graph G = (V, A), underlying undirected graph is H–minor-fr

    6.889 — Lecture 25: Single-Source Shortest Paths with Negative Lengths in Minor-Free Graphs Christian Sommer December 12, 2011 Setting directed graph G = (V, A), underlying undirected graph is H–minor-fr

    Add to Reading List

    Source URL: courses.csail.mit.edu

    Language: English - Date: 2011-12-12 21:15:55
      45The graph formulation of the union-closed sets conjecture Henning Bruhn1 , Pierre Charbit∗2 , Oliver Schaudt1 , and Jan Arne Telle†3 1

      The graph formulation of the union-closed sets conjecture Henning Bruhn1 , Pierre Charbit∗2 , Oliver Schaudt1 , and Jan Arne Telle†3 1

      Add to Reading List

      Source URL: www.zaik.uni-koeln.de

      Language: English - Date: 2014-06-05 04:13:35
      46Quantum query complexity of minor-closed graph properties Andrew M. Childs∗ Robin Kothari†  Department of Combinatorics & Optimization

      Quantum query complexity of minor-closed graph properties Andrew M. Childs∗ Robin Kothari† Department of Combinatorics & Optimization

      Add to Reading List

      Source URL: qip2011.quantumlah.org

      Language: English - Date: 2011-01-11 05:19:49
        47WeilSchaudt_DeltaChi_GaC.dvi

        WeilSchaudt_DeltaChi_GaC.dvi

        Add to Reading List

        Source URL: www.zaik.uni-koeln.de

        Language: English - Date: 2014-06-05 05:09:32
        48Markov bases of binary graph models of K4-minor free graphs Daniel Kr´al’∗ Serguei Norine†

        Markov bases of binary graph models of K4-minor free graphs Daniel Kr´al’∗ Serguei Norine†

        Add to Reading List

        Source URL: iti.mff.cuni.cz

        Language: English - Date: 2016-02-04 05:53:37
          49Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph pro

          Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph pro

          Add to Reading List

          Source URL: www.wisdom.weizmann.ac.il

          Language: English - Date: 2012-01-05 11:55:55
          50Vertex Separators and low tree-width k-coloring Lectures 11 and 12, January 12 and 19, A theorem about vertex separators

          Vertex Separators and low tree-width k-coloring Lectures 11 and 12, January 12 and 19, A theorem about vertex separators

          Add to Reading List

          Source URL: www.wisdom.weizmann.ac.il

          Language: English - Date: 2012-01-23 02:46:03